全文获取类型
收费全文 | 85503篇 |
免费 | 1123篇 |
国内免费 | 413篇 |
专业分类
电工技术 | 797篇 |
综合类 | 2318篇 |
化学工业 | 11876篇 |
金属工艺 | 4785篇 |
机械仪表 | 3086篇 |
建筑科学 | 2221篇 |
矿业工程 | 566篇 |
能源动力 | 1210篇 |
轻工业 | 3809篇 |
水利工程 | 1280篇 |
石油天然气 | 350篇 |
无线电 | 9394篇 |
一般工业技术 | 16612篇 |
冶金工业 | 2696篇 |
原子能技术 | 268篇 |
自动化技术 | 25771篇 |
出版年
2023年 | 30篇 |
2022年 | 31篇 |
2021年 | 78篇 |
2020年 | 91篇 |
2019年 | 85篇 |
2018年 | 14506篇 |
2017年 | 13434篇 |
2016年 | 10029篇 |
2015年 | 675篇 |
2014年 | 338篇 |
2013年 | 362篇 |
2012年 | 3300篇 |
2011年 | 9549篇 |
2010年 | 8396篇 |
2009年 | 5637篇 |
2008年 | 6867篇 |
2007年 | 7852篇 |
2006年 | 191篇 |
2005年 | 1250篇 |
2004年 | 1188篇 |
2003年 | 1222篇 |
2002年 | 573篇 |
2001年 | 121篇 |
2000年 | 193篇 |
1999年 | 65篇 |
1998年 | 68篇 |
1997年 | 52篇 |
1996年 | 54篇 |
1995年 | 21篇 |
1994年 | 24篇 |
1993年 | 20篇 |
1992年 | 21篇 |
1991年 | 23篇 |
1988年 | 12篇 |
1985年 | 12篇 |
1969年 | 24篇 |
1968年 | 43篇 |
1967年 | 35篇 |
1966年 | 42篇 |
1965年 | 44篇 |
1963年 | 28篇 |
1962年 | 22篇 |
1961年 | 18篇 |
1960年 | 30篇 |
1959年 | 35篇 |
1958年 | 37篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
The efficient representation and manipulation of a large number of paths in a Directed Acyclic Graph (DAG) requires the usage of special data structures that may become of exponential size with respect to the size of the graph. Several methodologies targeting Electronic Design Automation problems such as timing analysis, physical design, verification and testing involve path representation and necessary manipulation. Previous works proposed an encoding using Zero-suppressed Binary Decision Diagrams (ZDDs), which has been shown experimentally to cope well when representing structural or logical paths in VLSI circuits. However, it is well known that the ordering of the variables in a ZDD highly affects its size and, therefore, the efficiency of the methodologies utilizing these data structures. In this work, we show that using a reverse topological order for the ZDD variables bounds the number of nodes in the ZDD representing structural paths to the number of edges in the DAG considered, hence, making the ZDD size linear to the DAG’s size. This result, supported here both theoretically and experimentally, is very important as it can render methodologies with questionable scalability applicable to larger industrial designs. We demonstrate the applicability of the proposed variable ordering in one such methodology which utilizes ZDDs to grade the Path Delay Fault coverage of a given test set. 相似文献
23.
We provide a provable-security treatment of “robust” encryption. Robustness means it is hard to produce a ciphertext that is valid for two different users. Robustness makes explicit a property that has been implicitly assumed in the past. We argue that it is an essential conjunct of anonymous encryption. We show that natural anonymity-preserving ways to achieve it, such as adding recipient identification information before encrypting, fail. We provide transforms that do achieve it, efficiently and provably. We assess the robustness of specific encryption schemes in the literature, providing simple patches for some that lack the property. We explain that robustness of the underlying anonymous IBE scheme is essential for public-key encryption with keyword search (PEKS) to be consistent (meaning, not have false positives), and our work provides the first generic conversions of anonymous IBE schemes to consistent (and secure) PEKS schemes. Overall, our work enables safer and simpler use of encryption. 相似文献
24.
25.
In this paper, we propose a minimum projected-distance test for parametric single-index regression models when the predictors are measured with Berkson errors. This test asymptotically behaves like a locally smoothing test as if the null model were with one-dimensional predictor, and is omnibus to detect all global alternative models. The test can also detect local alternative models that converge to the null model at the fastest rate that the existing locally smoothing tests with one-dimensional predictor can achieve. Therefore, the proposed test has potential for alleviating the curse of dimensionality in this field. We also give two bias-correction methods to center the test statistic. Numerical studies are conducted to examine the performance of the proposed test. 相似文献
26.
27.
Yoon Hyuk Kim Batbayar Khuyagbaatar Kyungsoo Kim 《Journal of Mechanical Science and Technology》2018,32(1):1-10
The human cervical spine is a complex structure that is the most frequently injured site among all spinal injuries. Therefore, understanding of the cervical spine injury and dysfunction, and also biomechanical response to external stimuli is important. Finite element (FE) modeling can help researchers to access the internal stresses and strains in the bones, ligaments and soft tissues more realistically, and it has been widely adopted for spine biomechanics research. Although in recent years numerous techniques have been developed, there are no recent literature reviews on FE models of the cervical spine. Our objective was to present recent advances in FE modeling of the human cervical spine in terms of component modeling, material properties, and validation procedures. Model applications and further development are also discussed. The integration of new technologies will allow us to generate more accurate and comprehensive model of the cervical spine, which can increase efficiency and model applicability. Finally, the FE modeling can help to facilitate diagnosis, treatment, and prevention technologies for cervical spine injuries. 相似文献
28.
Venkidusamy Vasanthi Muniasamy Kottaisamy Veerabahu Ramakrishnan 《Journal of Materials Science: Materials in Electronics》2018,29(23):19724-19731
Optical properties of Zn doped Y2O3 microsheets prepared by sol–gel combustion method have been investigated and their application in phosphor converted white LED has been examined. The formation of single phase, well crystalline cubic Y2O3 is confirmed from powder XRD results. Effective substitution of Zn in Y2O3 crystal lattice is inferred from shifting of diffraction peaks. SEM images have showed that undoped as well as Zn doped Y2O3 formed as microsheets. Doping of Zn enhanced the growth of the sheets and its length increased from 1.5 to 19 µm. Development of structural disorder in Y2O3 crystal structure after Zn doping and confirmation of the conserved cubic structure of Zn doped Y2O3 without any secondary phase have been revealed from micro-Raman spectra. The optical band gap of Y2O3 has been altered after Zn doping and it is found to be decreased from 5.6 to 5.22 eV as increasing Zn concentration. Both undoped and Zn doped Y2O3 showed a broad visible emission from blue to green region due to various defects and impurities present in it. Broad PL excitation spectrum inferred the possibility to attain the visible emission under the excitation of light with wide range of wavelength from near UV to blue region. Excitation of pure Y2O3 under near UV (375 nm) LED chip lead to the emission of yellow light whereas Zn doped Y2O3 emitted warm white light with color coordinate of (0.42, 0.35), colour rendering index of 77.6 and correlated color temperature (CCT) of 2840 K. Hence, Zn doped Y2O3 discussed in the present work can be a better replacement for various rare earth doped phosphors in the application of phosphor converted WLED (pc-WLED). 相似文献
29.
30.
Wireless Sensor Networks (WSNs) are applied in many time-critical applications, e.g., industrial automation and smart grid. This highlights the importance of Delay Constrained Relay Node Placement (DCRNP) problem that builds a path fulfilling a specified delay constraint between each sensor and the sink by using a minimum number of relays. Due to the NP-hardness of the DCRNP problem, in this paper, a polynomial time Subtree-and-Mergence-based Algorithm (SMA) is proposed to approximately solve the DCRNP problem. First, a shortest path tree rooted at the sink and connecting all sensors is built to check the feasibility of the DCRNP problem. If the DCRNP problem is feasible, then the paths of this tree are progressively merged at some relays, which are not limited to those relays lying in the originally the originally built shortest path tree, to save deployed relays while maintaining the obedience of delay constraints. With the repetition of this mergence, the number of deployed relays is gradually reduced. Furthermore, the approximation ratio and the time complexity of the proposed SMA are elaborately analyzed. Finally, extensive simulations are conducted to demonstrate the effectiveness of this work. Simulation results show that SMA can significantly save deployed relays comparing with existing algorithms. 相似文献